翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

association fallacy : ウィキペディア英語版
association fallacy

An association fallacy is an inductive informal fallacy of the type hasty generalization or red herring which asserts that qualities of one thing are inherently qualities of another, merely by an irrelevant association. The two types are sometimes referred to as guilt by association and honor by association. Association fallacies are a special case of red herring, and can be based on an appeal to emotion.
== Form ==

In notation of first-order logic, this type of fallacy can be expressed as (''x''  ''S'' : ''φ''(''x'')) → (''x'' ∈ ''S'' : ''φ''(''x'')), meaning "if there exists any ''x'' in the set ''S'' so that a property ''φ'' is true for ''x'', then for all ''x'' in ''S'' the property ''φ'' must be true."
:Premise A is a B
:Premise A is also a C
:Conclusion Therefore, all Bs are Cs
The fallacy in the argument can be illustrated through the use of an Euler diagram: "A" satisfies the requirement that it is part of both sets "B" and "C", but if one represents this as an Euler diagram, it can clearly be seen that it is possible that a part of set "B" is ''not'' part of set "C", refuting the conclusion that "all Bs are Cs".

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「association fallacy」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.